Termination and Correctness Analysis of Cyclic Control

نویسندگان

  • Siddharth Srivastava
  • Neil Immerman
  • Shlomo Zilberstein
چکیده

The utility of including cyclic flow of control in plans has been long recognized by the planning community. Loops in a plan increase both its applicability and the compactness of representation. However, progress in finding such plans has been limited largely due to lack of methods for reasoning about the correctness and applicability of loops of actions. We present an overview of recent results for determining the class of problems that a plan with loops can solve. These methods can be used to direct the construction of a rich new form of generalized plans that solve a desired class of problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refinement-Based Verification for Possibly-Cyclic Lists

In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an acyclic linked list [10]. This paper reports on the automatic verification of the total correctness (partial correctness and termination) of the same list-reversal algorithm, when applied to a possibly-cyclic linked ...

متن کامل

Transforming Termination by Self-Labelling

We introduce a new technique for proving termination of term rewriting systems. The technique, a specialization of Zantema’s semantic labelling technique, is especially useful for establishing the correctness of transformation methods that attempt to prove termination by transforming term rewriting systems into systems whose termination is easier to prove. We apply the technique to modularity, ...

متن کامل

Verification of Mutual Recursive Functional Programs

We present an environment for proving total correctness of mutual recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae—verification conditions. As a distinctive feature of our method, these formulae are not only sufficient, but also necessary for the correctness. A specialized strategy for proving termination is developed. The de...

متن کامل

On the Relationship between Social Support and Early Breastfeeding Termination

Background: There is no substitute to mother breastfeeding; on the one hand, mothers need all-out support, especially in the first days after delivery, which is one of the effective factors for women’s success in breastfeeding. Objectives: The aim of this study is to investigate the relationship between social support and early termination of breastfeeding. Methods: This retrospective study e...

متن کامل

Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance

The control of polyvariance is a key issue in partial deduction of logic programs. Certainly, only nitely many specialised versions of any procedure should be generated, while, on the other hand, overly severe limitations should not be imposed. In this paper, well-founded orderings serve as a starting point for tackling this so-called \global termination" problem. Polyvariance is determined by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011